By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

A Linear Time Approach to the Set Maxima Problem

Amotz Bar-Noy, Rajeev Motwan, and Joseph Naor

pp. 1-9

BibTeX  Abstract Full Text:  PDF

Broadcasting in Bounded Degree Graphs

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, and Joseph G. Peters

pp. 10-24

BibTeX  Abstract Full Text:  PDF

Augmenting Graphs to Meet Edge-Connectivity Requirements

András Frank

pp. 25-53

BibTeX  Abstract Full Text:  PDF

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Hiroshi Nagamochi and Toshihide Ibaraki

pp. 54-66

BibTeX  Abstract Full Text:  PDF

A Forward Lower Restricted Ordering Algorithm for Digraphs

D. D. Olesky and T. A. Slater

pp. 67-73

BibTeX  Abstract Full Text:  PDF

Generalized Chromatic Numbers of Random Graphs

Edward R. Scheinerman

pp. 74-80

BibTeX  Abstract Full Text:  PDF

A Technique for Lower Bounding the Cover Time

David Zuckerman

pp. 81-87

BibTeX  Abstract Full Text:  PDF

Bounded Round Interactive Proofs in Finite Groups

László Babai

pp. 88-111

BibTeX  Abstract Full Text:  PDF

Disjoint Paths in a Planar Graph—A General Theorem

Guoli Ding, A. Schrijver, and P. D. Seymour

pp. 112-116

BibTeX  Abstract Full Text:  PDF

On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design

Michael R. Fellows and Michael A. Langston

pp. 117-126

BibTeX  Abstract Full Text:  PDF

On Tensor Powers of Integer Programs

Robin Pemantle, James Propp, and Daniel Ullman

pp. 127-143

BibTeX  Abstract Full Text:  PDF

Pair Labelings of Graphs

David R. Guichard and John W. Krussel

pp. 144-149

BibTeX  Abstract Full Text:  PDF